Lexicographically Maximum Dynamic Flow with Vertex Capacities
نویسندگان
چکیده
منابع مشابه
Universally Maximum Flow with Piecewise-Constant Capacities
A maximum flow over time generalizes standard maximum flow by introducing a time component. The object is to send as much flow from source to sink in T time units as possible, where capacities are interpreted as an upper bound on the rate of flow entering an arc. A related problem is the universally maximum flow, which is to send a flow from source to sink that maximizes the amount of flow arri...
متن کاملA dynamic location problem with maximum decreasing capacities
In this paper a capacitated dynamic location problem with opening, closure and reopening of facilities is formulated and a primal-dual heuristic that can solve this problem is described. The problem formulated considers the situation where a facility is open (or reopens) with a certain maximum capacity that decreases as clients are assigned to that facility during its operating periods. This pr...
متن کاملDynamic Approximate Vertex Cover and Maximum Matching
We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge insertion. We give the first data structure that simultaneously achieves a constant approximation factor and handles a sequence of k updates in k · polylog(n) time. Previous data structures require a polynomial amount of ...
متن کاملSimultaneous Parametric Maximum Flow Algorithm with Vertex Balancing
Two new algorithms, SPMF and SPMF, for finding the complete chain of solutions of the selection model are presented in this paper. A special kind of residual path, called a λ-directed simple residual path, is identified to be the only kind of residual path necessary for SPMF. By augmenting the right amount of flows along the λ-directed simple residual paths, the new algorithms are monotone conv...
متن کاملComputing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities
We study the maximum flow problem in an undirected planar network with both edge and vertex capacities (EVC-network). A previous study reduces the minimum cut problem in an undirected planar EVC-network to the minimum edge-cut problem in another planar network with edge capacity only (EC-network), thus the minimum-cut or the maximum flow value can be computed in O(n log n) time. Based on this r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematics and Statistics
سال: 2020
ISSN: 1549-3644
DOI: 10.3844/jmssp.2020.142.147